Algebraic Specification Method of Programming Languages
نویسندگان
چکیده
منابع مشابه
Higher Order and Reactive Algebraic Specification and Development
Algebraic specification frameworks such as the Casl family of specification languages are presently expanding to encompass all aspects of software, including e.g. functional programming and reactive specification. Thus, a comprehensive environment for formal software development is being created. This paper gives an overview of publications by the author that contribute to this goal, both in th...
متن کاملThe Beauty and the Beast
This paper presents a method for programming window-based I/O in a pure functional language. This method enables the programmer to specify interactions at a very high level of abstraction. It employs a machine independent declarative specification of devices such as windows, dialogues and menus. These devices are specified via predefined algebraic data types containing event handlers (user defi...
متن کاملSpecification of Generic APIs, or: Why Algebraic May Be Better then Pre/Post
Specification based on Floyd-Hoare logic, using pre and postconditions, is common in languages aimed at high integrity software. Such pre/postcondition specifications are geared towards verification of code. While this specification technique has proven quite successful in the past 40 years, it has limitations when applied to API specification, particularly specification of generic interfaces. ...
متن کاملAlgebraic Semantics of Object Type Specifications
Object oriented programming languages are more and more popular and the “object oriented approaches” seem to be increasingly appreciated for software engineering tasks. We believe that it would be a pity if classical formal specification languages would not follow this evolution. A lot of works have already been done ; they often address the problem of defining models to reflect object oriented...
متن کاملOn Describing Terminating Algebraic Specifications Based on Their Models
OBJ algebraic specification languages support automated equational reasoning based on term rewriting systems (TRSs) for specification verification. Termination is one of the most important properties of TRSs. Terminating TRSs guarantee that any equational reasoning terminates in finite times. Although termination is an undecidable property, several sufficient conditions have been proposed, and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1984